A self-stabilizing memory efficient algorithm for the minimum diameter spanning tree under an omnipotent daemon
نویسندگان
چکیده
منابع مشابه
A Uniform Self-Stabilizing Minimum Diameter Spanning Tree Algorithm
We present a uniform self-stabilizing algorithm, which solves the problem of distributively nding a minimum diameter spanning tree of an arbitrary positively real-weighted graph. Our algorithm consists in two stages of stabilizing protocols. The rst stage is a uniform randomized stabilizing unique naming protocol, and the second stage is a stabilizing MDST protocol, designed as a fair compositi...
متن کاملDistributed Self-Stabilizing Algorithm for Minimum Spanning Tree Construction
Minimal Spanning Tree (MST) problem in an arbitrary undirected graph is an important problem in graph theory and has extensive applications. Numerous algorithms are available to compute an MST. Our purpose here is to propose a self-stabilizing distributed algorithm for the MST problem and to prove its correctness. The algorithm utilizes an interesting result of [MP88]. We show the correctness o...
متن کاملFast Self-Stabilizing Minimum Spanning Tree Construction
We present a novel self-stabilizing algorithm for minimum spanning tree (MST) construction. The space complexity of our solution is O(log n) bits and it converges in O(n) rounds. Thus, this algorithm improves the convergence time of all previously known selfstabilizing asynchronous MST algorithms by a multiplicative factor Θ(n), to the price of increasing the best known space complexity by a fa...
متن کاملA Distributed Algorithm for the Minimum Diameter Spanning Tree Problem
We present a new algorithm, which solves the problem of distributively nding a minimum diameter spanning tree of any arbitrary positively real-weighted graph. We use a new fast linear time intermediate all-pairs shortest paths routing protocol. The resulting distributed algorithm is asynchronous, it works for arbitrary named network, and achieves O(n) time complexity and O(nm) message complexity.
متن کاملA Distributed Algorithm for Constructing a Minimum Diameter Spanning Tree
We present a new algorithm, which solves the problem of distributively finding a minimum diameter spanning tree of any (non-negatively) real-weighted graph G = (V, E, ω). As an intermediate step, we use a new, fast, linear-time all-pairs shortest paths distributed algorithm to find an absolute center of G. The resulting distributed algorithm is asynchronous, it works for named asynchronous arbi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Parallel and Distributed Computing
سال: 2018
ISSN: 0743-7315
DOI: 10.1016/j.jpdc.2018.02.007